Escape rates for rotor walks in Z
نویسندگان
چکیده
Rotor walk is a deterministic analogue of random walk. We study its recurrence and transience properties on Z for the initial configuration of all rotors aligned. If n particles in turn perform rotor walks starting from the origin, we show that the number that escape (i.e., never return to the origin) is of order n in dimensions d ≥ 3, and of order n/ log n in dimension 2.
منابع مشابه
Rotor Walks on General Trees
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an infinite rooted tree, restarted from the root after each escape to infinity. We prove that the limiting proportion of escapes to infinity equals the escape proba...
متن کاملInfinite Excursions of Router Walks on Regular Trees
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: at each step it chooses the next unused rotor in its current location, and uses it to jump to the neighboring vertex to which it points. Rotor...
متن کاملThe Rotor-Router Group of Directed Covers of Graphs
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we study several quantities related to rotor-router walks on directed covers. The quantities under consideration are: order of the rotor-router group, order of t...
متن کاملErratum: Transience and recurrence of rotor-router walks on directed covers of graphs
In the paper [4] Transience and recurrence of rotor-router walks on directed covers of graphs, published in ECP volume 17 (2012), no. 41 there is an error in the proof of Corollary 3.8. This corollary is essential for the transient part in the proof of Theorem 3.5(b). We fix this error by constructing a new rotor-router process, which fulfills our needs, and for which the statement of Corollary...
متن کاملAcceleration of lamplighter random walks
Suppose we are given an infinite, finitely generated group G and a transient random walk with bounded range on the wreath product (Z/2Z) ≀ G, such that its projection on G is transient. This random walk can be interpreted as a lamplighter random walk, where there is a lamp at each element of G, which can be switched on and off, and a lamplighter walks along G and switches lamps randomly on and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013